0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.11/0.33	% Computer   : n018.cluster.edu
0.11/0.33	% Model      : x86_64 x86_64
0.11/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory     : 8042.1875MB
0.11/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1200
0.11/0.33	% WCLimit    : 120
0.11/0.33	% DateTime   : Tue Jul 13 12:58:38 EDT 2021
0.11/0.33	% CPUTime    : 
0.11/0.33	% Number of cores: 8
0.11/0.33	% Python version: Python 3.6.8
0.11/0.33	# Version: 2.6rc1-ho
0.11/0.34	# No SInE strategy applied
0.11/0.34	# Trying AutoSched0 for 59 seconds
0.38/0.57	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.38/0.57	# and selection function SelectMaxLComplexAvoidPosPred.
0.38/0.57	#
0.38/0.57	# Preprocessing time       : 0.077 s
0.38/0.57	
0.38/0.57	# Proof found!
0.38/0.57	# SZS status Theorem
0.38/0.57	# SZS output start CNFRefutation
0.38/0.57	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.38/0.57	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.38/0.57	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.38/0.57	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.38/0.57	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)).
0.38/0.57	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X422:$i]:(in @ X422 @ X1=>(X2 @ X422=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.38/0.57	thf(def_n_is, axiom, (n_is)=(^[X498:$i, X499:$i]:(X498)=(X499)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.38/0.57	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.38/0.57	thf(def_n_some, axiom, (n_some)=(^[X500:$i > $o]:(![X501:$i]:(in @ X501 @ nat=>(X500 @ X501=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.38/0.57	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)).
0.38/0.57	thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X525:$i]:(in @ X525 @ nat=>((X185)=(n_pl @ X1 @ X525)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)).
0.38/0.57	thf(satz5, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X204:$i]:in @ X204 @ nat) @ (^[X205:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:n_is @ (n_pl @ (n_pl @ X1 @ X205) @ X4) @ (n_pl @ X1 @ (n_pl @ X205 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz5)).
0.38/0.57	thf(satz19c, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X240:$i]:in @ X240 @ nat) @ (^[X241:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:(iii @ (n_pl @ X1 @ X4) @ (n_pl @ X241 @ X4)<=iii @ X1 @ X241)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz19c)).
0.38/0.57	thf(satz6, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X222:$i]:in @ X222 @ nat) @ (^[X223:$i]:n_is @ (n_pl @ X1 @ X223) @ (n_pl @ X223 @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz6)).
0.38/0.57	thf(c_0_14, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.38/0.57	thf(c_0_15, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.38/0.57	thf(c_0_16, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_14])).
0.38/0.57	thf(c_0_17, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X422:$i]:(in @ X422 @ X1=>(X2 @ X422=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_15]), c_0_14]), c_0_16])).
0.38/0.57	thf(c_0_18, axiom, (n_is)=(^[X498:$i, X499:$i]:(X498)=(X499)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.38/0.57	thf(c_0_19, axiom, (n_some)=(^[X500:$i > $o]:(![X501:$i]:(in @ X501 @ nat=>(X500 @ X501=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_17])).
0.38/0.57	thf(c_0_20, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_18])).
0.38/0.57	thf(c_0_21, axiom, (iii)=(^[X1:$i, X185:$i]:(![X525:$i]:(in @ X525 @ nat=>((X185)=(n_pl @ X1 @ X525)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_19]), c_0_20])).
0.38/0.58	thf(c_0_22, plain, ![X917:$i]:(in @ X917 @ nat=>![X922:$i]:(in @ X922 @ nat=>![X923:$i]:(in @ X923 @ nat=>(n_pl @ (n_pl @ X917 @ X922) @ X923)=(n_pl @ X917 @ (n_pl @ X922 @ X923))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz5, c_0_15]), c_0_18])).
0.38/0.58	thf(c_0_23, negated_conjecture, ~(![X1261:$i]:(in @ X1261 @ nat=>![X1268:$i]:(in @ X1268 @ nat=>![X1269:$i]:(in @ X1269 @ nat=>(~(![X1271:$i]:(in @ X1271 @ nat=>(X1268)!=(n_pl @ X1261 @ X1271)))=>~(![X1270:$i]:(in @ X1270 @ nat=>(n_pl @ X1268 @ X1269)!=(n_pl @ (n_pl @ X1261 @ X1269) @ X1270)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz19c]), c_0_15]), c_0_21])])).
0.38/0.58	thf(c_0_24, plain, ![X1983:$i, X1984:$i, X1985:$i]:(~in @ X1983 @ nat|(~in @ X1984 @ nat|(~in @ X1985 @ nat|(n_pl @ (n_pl @ X1983 @ X1984) @ X1985)=(n_pl @ X1983 @ (n_pl @ X1984 @ X1985))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
0.38/0.58	thf(c_0_25, negated_conjecture, ![X2055:$i]:(in @ esk58_0 @ nat&(in @ esk59_0 @ nat&(in @ esk60_0 @ nat&((in @ esk61_0 @ nat&(esk59_0)=(n_pl @ esk58_0 @ esk61_0))&(~in @ X2055 @ nat|(n_pl @ esk59_0 @ esk60_0)!=(n_pl @ (n_pl @ esk58_0 @ esk60_0) @ X2055)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])).
0.38/0.58	thf(c_0_26, plain, ![X1079:$i]:(in @ X1079 @ nat=>![X1083:$i]:(in @ X1083 @ nat=>(n_pl @ X1079 @ X1083)=(n_pl @ X1083 @ X1079))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz6, c_0_15]), c_0_18])).
0.38/0.58	thf(c_0_27, plain, ![X1:$i, X4:$i, X5:$i]:((n_pl @ (n_pl @ X1 @ X4) @ X5)=(n_pl @ X1 @ (n_pl @ X4 @ X5))|~in @ X1 @ nat|~in @ X4 @ nat|~in @ X5 @ nat), inference(split_conjunct,[status(thm)],[c_0_24])).
0.38/0.58	thf(c_0_28, negated_conjecture, (esk59_0)=(n_pl @ esk58_0 @ esk61_0), inference(split_conjunct,[status(thm)],[c_0_25])).
0.38/0.58	thf(c_0_29, negated_conjecture, in @ esk61_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_25])).
0.38/0.58	thf(c_0_30, negated_conjecture, in @ esk58_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_25])).
0.38/0.58	thf(c_0_31, plain, ![X2016:$i, X2017:$i]:(~in @ X2016 @ nat|(~in @ X2017 @ nat|(n_pl @ X2016 @ X2017)=(n_pl @ X2017 @ X2016))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])).
0.38/0.58	thf(c_0_32, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(n_pl @ esk59_0 @ esk60_0)!=(n_pl @ (n_pl @ esk58_0 @ esk60_0) @ X1)), inference(split_conjunct,[status(thm)],[c_0_25])).
0.38/0.58	thf(c_0_33, negated_conjecture, in @ esk60_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_25])).
0.38/0.58	thf(c_0_34, negated_conjecture, ![X1:$i]:((n_pl @ esk58_0 @ (n_pl @ esk61_0 @ X1))=(n_pl @ esk59_0 @ X1)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29]), c_0_30])])).
0.38/0.58	thf(c_0_35, plain, ![X1:$i, X4:$i]:((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_31])).
0.38/0.58	thf(c_0_36, negated_conjecture, ![X1:$i]:((n_pl @ esk58_0 @ (n_pl @ esk60_0 @ X1))!=(n_pl @ esk59_0 @ esk60_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_27]), c_0_33]), c_0_30])])).
0.38/0.58	thf(c_0_37, negated_conjecture, ![X1:$i]:((n_pl @ esk58_0 @ (n_pl @ X1 @ esk61_0))=(n_pl @ esk59_0 @ X1)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_29])])).
0.38/0.58	thf(c_0_38, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_29]), c_0_33])]), ['proof']).
0.38/0.58	# SZS output end CNFRefutation
0.38/0.58	# Proof object total steps             : 39
0.38/0.58	# Proof object clause steps            : 11
0.38/0.58	# Proof object formula steps           : 28
0.38/0.58	# Proof object conjectures             : 12
0.38/0.58	# Proof object clause conjectures      : 9
0.38/0.58	# Proof object formula conjectures     : 3
0.38/0.58	# Proof object initial clauses used    : 7
0.38/0.58	# Proof object initial formulas used   : 14
0.38/0.58	# Proof object generating inferences   : 4
0.38/0.58	# Proof object simplifying inferences  : 11
0.38/0.58	# Training examples: 0 positive, 0 negative
0.38/0.58	# Parsed axioms                        : 371
0.38/0.58	# Removed by relevancy pruning/SinE    : 0
0.38/0.58	# Initial clauses                      : 548
0.38/0.58	# Removed in clause preprocessing      : 156
0.38/0.58	# Initial clauses in saturation        : 392
0.38/0.58	# Processed clauses                    : 458
0.38/0.58	# ...of these trivial                  : 8
0.38/0.58	# ...subsumed                          : 30
0.38/0.58	# ...remaining for further processing  : 420
0.38/0.58	# Other redundant clauses eliminated   : 594
0.38/0.58	# Clauses deleted for lack of memory   : 0
0.38/0.58	# Backward-subsumed                    : 0
0.38/0.58	# Backward-rewritten                   : 7
0.38/0.58	# Generated clauses                    : 5040
0.38/0.58	# ...of the previous two non-trivial   : 4388
0.38/0.58	# Contextual simplify-reflections      : 1
0.38/0.58	# Paramodulations                      : 4209
0.38/0.58	# Factorizations                       : 0
0.38/0.58	# NegExts                              : 2
0.38/0.58	# Equation resolutions                 : 632
0.38/0.58	# Propositional unsat checks           : 0
0.38/0.58	#    Propositional check models        : 0
0.38/0.58	#    Propositional check unsatisfiable : 0
0.38/0.58	#    Propositional clauses             : 0
0.38/0.58	#    Propositional clauses after purity: 0
0.38/0.58	#    Propositional unsat core size     : 0
0.38/0.58	#    Propositional preprocessing time  : 0.000
0.38/0.58	#    Propositional encoding time       : 0.000
0.38/0.58	#    Propositional solver time         : 0.000
0.38/0.58	#    Success case prop preproc time    : 0.000
0.38/0.58	#    Success case prop encoding time   : 0.000
0.38/0.58	#    Success case prop solver time     : 0.000
0.38/0.58	# Current number of processed clauses  : 382
0.38/0.58	#    Positive orientable unit clauses  : 89
0.38/0.58	#    Positive unorientable unit clauses: 3
0.38/0.58	#    Negative unit clauses             : 18
0.38/0.58	#    Non-unit-clauses                  : 272
0.38/0.58	# Current number of unprocessed clauses: 4299
0.38/0.58	# ...number of literals in the above   : 20795
0.38/0.58	# Current number of archived formulas  : 0
0.38/0.58	# Current number of archived clauses   : 7
0.38/0.58	# Clause-clause subsumption calls (NU) : 28243
0.38/0.58	# Rec. Clause-clause subsumption calls : 4408
0.38/0.58	# Non-unit clause-clause subsumptions  : 27
0.38/0.58	# Unit Clause-clause subsumption calls : 5155
0.38/0.58	# Rewrite failures with RHS unbound    : 2
0.38/0.58	# BW rewrite match attempts            : 46
0.38/0.58	# BW rewrite match successes           : 5
0.38/0.58	# Condensation attempts                : 0
0.38/0.58	# Condensation successes               : 0
0.38/0.58	# Termbank termtop insertions          : 147835
0.38/0.58	
0.38/0.58	# -------------------------------------------------
0.38/0.58	# User time                : 0.235 s
0.38/0.58	# System time              : 0.012 s
0.38/0.58	# Total time               : 0.247 s
0.38/0.58	# Maximum resident set size: 2224 pages
0.38/0.58	EOF